Complexity of tropical Schur polynomials
نویسندگان
چکیده
We study the complexity of computation of a tropical Schur polynomial Tsλ where λ is a partition, and of a tropical polynomial Tmλ obtained by the tropicalization of the monomial symmetric function mλ. Then Tsλ and Tmλ coincide as tropical functions (so, as convex piece-wise linear functions), while differ as tropical polynomials. We prove the following bounds on the complexity of computing over the tropical semi-ring (R,max,+): • a polynomial upper bound for Tsλ and • an exponential lower bound for Tmλ. Also the complexity of tropical skew Schur polynomials is discussed.
منابع مشابه
Tropicalization, symmetric polynomials, and complexity
D. Grigoriev-G. Koshevoy recently proved that tropical Schur polynomials have (at worst) polynomial tropical semiring complexity. They also conjectured tropical skew Schur polynomials have at least exponential complexity; we establish a polynomial complexity upper bound. Our proof uses results about (stable) Schubert polynomials, due to R. P. Stanley and S. Billey-W. Jockusch-R. P. Stanley, tog...
متن کاملA tropical view on the Bruhat-Tits building of SL and its compactifications
We describe the stabilizers of points in the Bruhat-Tits building of the group SL with tropical geometry. There are several compactifications of this building associated to algebraic representations of SL. We show that the fans used to compactify apartments in this theory are given by tropical Schur polynomials. 2000 MSC: 20E42, 20G25, 52B99
متن کاملOn semiring complexity of Schur polynomials
Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that semiring complexity of a Schur polynomial sλ(x1, . . . , xk) labeled by a partition λ = (λ1 ≥ λ2 ≥ · · · ) is bounded by O(log(λ1)) provided the number of variables k is fixed.
متن کاملEquivariant Cohomology in Algebraic Geometry Lecture Eight: Equivariant Cohomology of Grassmannians Ii
σλ = |c T λi+j−i(Q− Fl+i−λi)|1≤i,j≤k. These determinants are variations of Schur polynomials, which we will call double Schur polynomials and denote sλ(x|y), where the two sets of variables are x = (x1, . . . , xk) and y = (y1, . . . , yn). (Here k ≤ n, and the length of λ is at most k.) Setting the y variables to 0, one recovers the ordinary Schur polynomials: sλ(x|0) = sλ(x). In fact, sλ(x|y)...
متن کاملPieri’s Formula for Generalized Schur Polynomials
Young’s lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized Schur operators to generalize the Robinson-Schensted-Knuth correspondence. In this sense, generalized Schur operators are generalizations of semi-standard Young...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 74 شماره
صفحات -
تاریخ انتشار 2016